A Decoding Scheme for the 4 - Ary Lexicodes with D = 3

A Decoding Scheme for the 4-ary Lexicodes with dm=4

Study of Random Biased d-ary Tries Model

Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...

A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem

At CRYPTO’93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The pro...

An Effect of Erasure Decoding Scheme in FH/SSMA Systems with RS Codes and M-ary FSK Signaling

In this paper, we analyze an effect of erasure decoding scheme for RS (Reed-Solomon) codes in frequency-hopped multiple-access systems with M-ary FSK signaling. RS coding is used to correct erasures and errors caused by other-user interference and thermal noise. The proposed decoding scheme carries out the adaptive erasure-decision process according to the channel traffic prior to decoding proc...

Robust multiplicative video watermarking using statistical modeling

The present paper is intended to present a robust multiplicative video watermarking scheme. In this regard, the video signal is segmented into 3-D blocks like cubes, and then, the 3-D wavelet transform is applied to each block. The low frequency components of the wavelet coefficients are then used for data embedding to make the process robust against both malicious and unintentional attacks. Th...